Buscar
Mostrando ítems 1-10 de 259
Partitioning edge-colored hypergraphs into few monochromatic tight cycles
(Siam, 2020)
Confirming a conjecture of Gyarfas, we prove that, for all natural numbers k and r, the vertices of every r-edge-colored complete k-uniform hypergraph can be partitioned into a bounded number (independent of the size of ...
A predictive view of Bayesian clustering
(ELSEVIER, 2006)
This work considers probability models for partitions of a set of n elements using a predictive approach, i.e., models that are specified in terms of the conditional probability of either joining an already existing cluster ...
Partitions of integers
(Wolfram Demonstration Project, 2013)
Partitions of integers
(Wolfram Demonstration Project, 2016)
Partitioning chordal graphs into independent sets and cliques
(BrasilInstituto Tércio Pacitti de Aplicações e Pesquisas Computacionais, 2017)
An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment
(Springer Nature Switzerland, 2020)
Quando A Soma E O Produto Entre Números Naturais Coincide?
(Universidade Federal de São Paulo (UNIFESP), 2017-04-20)
This Work Addresses The Question Of Equality Between The Product And The Sum Of A Finite Number Of Natural Numbers. The Approach Is Quite Natural, Intuitive And Constructive, Established Using The Operations Of Adding And ...